Nonsmooth Equations in Optimization Nonconvex Optimization and Its Applications
نویسندگان
چکیده
The titles published in this series are listed at the end of this volume. 1 1 2 4 4 4 5 5 6 6 7 9 Multifunctions and Derivatives Particular Locally Lipschitz Functions and Related Definitions Generalized Jacobians of Locally Lipschitz Functions Pseudo-Smoothness and D°f Piecewise Functions NCP Functions 1.4 Definitions of Regularity Definitions of Lipschitz Properties Regularity Definitions Functions and Multifunctions
منابع مشابه
Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملPenalty Dual Decomposition Method For Nonsmooth Nonconvex Optimization
Many contemporary signal processing, machine learning and wireless communication applications can be formulated as nonconvex nonsmooth optimization problems. Often there is a lack of efficient algorithms for these problems, especially when the optimization variables are nonlinearly coupled in some nonconvex constraints. In this work, we propose an algorithm named penalty dual decomposition (PDD...
متن کاملExistence of Solutions for Nonconvex and Nonsmooth Vector Optimization Problems
We consider the weakly efficient solution for a class of nonconvex and nonsmooth vector optimization problems in Banach spaces. We show the equivalence between the nonconvex and nonsmooth vector optimization problem and the vector variational-like inequality involving set-valued mappings. We prove some existence results concerned with the weakly efficient solution for the nonconvex and nonsmoot...
متن کاملDesign of process operations using hybrid dynamic optimization
Accurate nonlinear dynamic models of process operations such as start-ups, shut-downs, and complex changeovers include state dependent events that trigger discrete changes to the describing equations, and are best analyzed within a hybrid systems framework. The automated design of an optimal process operation can thus be formulated as a dynamic optimization problem with a hybrid system embedded...
متن کامل